MARKOV- AND BERNSTEIN-TYPE INEQUALITIES FOR MÜNTZ POLYNOMIALS AND EXPONENTIAL SUMS IN Lp
نویسندگان
چکیده
The principal result of this paper is the following Markov-type inequality for Müntz polynomials. Theorem (Newman’s Inequality in Lp[a, b] for [a, b] ⊂ (0,∞)). Let Λ := (λj) ∞ j=0 be an increasing sequence of nonnegative real numbers. Suppose λ0 = 0 and there exists a δ > 0 so that λj ≥ δj for each j. Suppose 0 < a < b and 1 ≤ p ≤ ∞. Then there exists a constant c(a, b, δ) depending only on a, b, and δ so that ‖P ‖Lp[a,b] ≤ c(a, b, δ) 0 @ n X j=0 λj 1 A ‖P‖Lp[a,b] for every P ∈ Mn(Λ), where Mn(Λ) denotes the linear span of {xλ0 , xλ1 , . . . , xλn} over R. When p = ∞ this has been shown in [5]. When [a, b] = [0, 1] and with ‖P ‖Lp [a,b] replaced with ‖xP (x)‖Lp [a,b] this was proved by D. Newman [13] for p = ∞ and by P. Borwein and T. Erdélyi [3] for 1 ≤ p ≤ ∞. Note that the interval [0, 1] plays a special role in the study of Müntz spaces Mn(Λ). A linear transformation y = αx+β does not preserve membership in Mn(Λ) in general (unless β = 0). So the analogue of Newman’s Inequality on [a, b] for a > 0 does not seem to be obtainable in any straightforward fashion from the [0, b] case.
منابع مشابه
Bernstein and Markov type inequalities for trigonometric polynomials on general sets∗
Bernstein and Markov-type inequalities are discussed for the derivatives of trigonometric and algebraic polynomials on general subsets of the real axis and of the unit circle. It has recently been proven by A. Lukashov that the sharp Bernstein factor for trigonometric polynomials is the equilibrium density of the image of the set on the unit circle under the mapping t → e. In this paper Lukasho...
متن کاملUpdates on Some Letters of George G. Lorentz to Me
I started my research in approximation theory in a time when George Lorentz was one of the central figures, an undisputed world expert, of the subject. It meant a lot to me that he paid a special attention to my work on polynomial inequalities, Markov and Bernstein type inequalities in particular. A few years later I had a feeling he viewed me as one of the leading experts of Müntz polynomials ...
متن کاملA Survey of Weighted Polynomial Approximation with Exponential Weights
Let W : R → (0, 1] be continuous. Bernstein’s approximation problem, posed in 1924, deals with approximation by polynomials in the weighted uniform norm f → ‖fW‖L∞(R). The qualitative form of this problem was solved by Achieser, Mergelyan, and Pollard, in the 1950’s. Quantitative forms of the problem were actively investigated starting from the 1960’s. We survey old and recent aspects of this t...
متن کاملOne-step dispatching policy improvement in multiple-server queueing systems with Poisson arrivals
Policy iteration techniques for multiple-server dispatching rely on the computation of value functions. In this context, we consider the M/G/1FCFS queue endowed with an arbitrarily-designed cost function for the waiting times of the incoming jobs, and we study an undiscounted value function integrating the total cost surplus expected from each state relative to the steady-state costs. When coup...
متن کاملApproximating distributions and transient probabilities of Markov chains by Bernstein expolynomial functions
In this extended abstract we consider the use of Bernstein polynomials (BPs) for the approximation of distributions and transient probabilities of continuous time Markov chains (CTMCs). We show that while standard BPs are not appropriate to this purpose it is possible to derive from them a family of functions, called in the sequel Bernstein expolynomials (BEs), which enjoys those properties tha...
متن کامل